Expanded search for tree allocated processors

ABSTRACT

A trained processor is described which operates beyond an untrained point. Information is stored in a memory array in a tree allocated file. Information is stored in the memory as key functions with associated trained responses. After the processor has been trained, it is able during an execution cycle to find and appropriate response for other key functions. These key functions are compared with the reference key functions stored in the memory array to find an appropriate trained response. During the execution cycle, there are some key functions for which there is no corresponding reference key function stored in the memory array and thereupon no appropriate trained response. These key functions for which no trained response is found are termed untrained points. Thereupon a key function which constitutes an untrained point is effectively compared with the reference key functions stored in the memory array to establish and store a difference function relative to each stored key function. Logic means then selects for the untrained point a trained response from those trained responses best satisfying a predetermined decision criteria. During the comparison operation, conditions are measured that indicate when key functions corresponding to a given group of trained responses cannot be an appropriate response for the untrained point in question. Logic means waive further examination of stored key functions, and thereby greatly expedite the efficiency of search.

United States Patent 1 3,678,461

Choate et a]. [451 July 18, 1972 [54] EXPANDED SEARCH FOR TREE ALLOCATED PROCESSORS ABSTRACT [72] Inventors: William C. Choate, Dallas; Michael K. A trained processor is described which operates beyond an Malt/en, Richardson, both of Tex. untrained point. information is stored in a memory array in a tree allocated file. information is stored in the memory as key [73] Asslgnee lmponud Dallas functions with associated trained responses. After the processor has been trained, it is able during an execution cycle to [22] Filed: June 1, 1970 find and appropriate response for other key functions. These [2]] AppL No: 42,430 key functions are compared with the reference key functions stored in the memory array to find an approprlate trained response. During the execution cycle, there are some key 1 Cl l ..340/172.5 functions for which there is no corresponding reference key [51] Int.Cl. ...G06f 15/40 function stored in the memory array and thereupon no ap- [58] Field of Search ..340/172.$ propriate trained response. These key functions for which no trained response is found are termed untrained points. 1141111168 CIM Thereupon a key function which constitutes an untrained point is effectively compared with the reference key functions UNITED STATES PATENTS stored in the memory array to establish and store a difference R26,9l9 6/1970 l-lagelbarger et a1 ..340/l72.5 function relative to each stored key function. Logic means 3,309,674 3/1967 Lemay ....340/l72.5 then selects for the untrained point a trained response from 3,440,6l7 4/1969 Lesti ....340/ 172.5 those trained responses best satisfying a predetermined deci- 3,333,248 7/1967 Greenberg et al. ....340/172.5 sion criteria. During the comparison operation, conditions are 3,209,323 65 B nn r 340/172-5 X measured that indicate when key functions corresponding to a R26,772 1/1970 Lazarus... "340/172 given group of trained responses cannot be an appropriate response for the untrained point in question. Logic means Primary Examiner-Paul J. Henon waive further examination of stored key functions. and l" y Chll'lm thereby greatly expedite the efficiency of search. Anorney-James 0. DIXOH, Andrew M. Hassell, Hal Levine, Rene E. Grossman and James T. Comfort 24 Clalns. 32 Drawlna Figures L E V E L I 2 3 4 EXECUTION KEY 2425 IDIF=| 2DlF=3 IDIF=4 4D|F=5 CD 6950m 4 DIF 5 DIF 8 DIF=6 Patented July 18, 1972 20 Sheets-Sheet 5 VAL ADP VAL ADP VAL ADP Fig.6. VAL ADP VAL ADP VAL ADP VAL ADP VAL ADP VAL ADP VAL ADP VAL ADP VAL ADP VAL ADP VAL ADP VAL ADP VAL ADP VAL ADP J VAL ADP Fig. 9.

VAL ADP G Patented July 18, 1972 3,678,461

20 Sheets-Sheet 6 INITIALIZATION Ff SET ALL 1o= o IC= 0 SET VALUE OF N READ INPUT SIGNAL (51 AND DESIRED OUTPUT J VJ 4 QUANTIZE SIGNALS I UNTRAINED POINT G) LEVEL= I I IDUM=| IDUM IDUM+ l LEVEL LEVEL +l ED (Z ,I-DU M Y5 a 7 mum mum I I40 EXECUTE: Q

LEVEL LEVEL I IDUM- 1c 69 TRAIN mum 1c A 69' x= 10 II, 10mm) no (2.1mm)

Patented July 18, 1972 3,678,461

20 Sheets-Sheet '7 VAL ADP ADF N VAL ADP ADF N VAL ADP G A i I I 2 J II 2 3 J I 3 I I Fig,

VAL ADPADF N VAL ADP ADF N VAL ADP C A I I 2 2 F II 4 3 l r I 3 2 I l l I LVAL ADPADF N VAL ADP G A F/gI/Z I2 2 5 I F 4 5 2 I VAL ADPADF N VAL ADPADF N VAL ADP c; A

--- I I 2 3 V II 4 3 I I 3 z I G) L V I l LVAL ADP ADF N VAL ADP G A F/'g,/3 I2 2 5 2 F 4 5 2 I VAL ADP ADF N VAL ADP ADF N VAL ADP G A I I 2 3 I2 4 5 2 I 3 z I (D I l LVAL ADP ADF N AL ADP G A I II 2 3 I 4 6 2 I F/gI/4 I 6) I VAL ADP G A Patented July 18, 1972 3,678,461

20 Sheets-Sheet 8 VAL ADPADF N VAL ADPADF N VAL ADP G H -||24]- |2452-|3z,|

VALADPADF AL ADP s H u 7 3 1 4 e z Fl 2 VAL ADP ADF N VAL ADP G A VAL ADP G A VAL ADPADF N VAL ADPADF N VAL ADP G A ---||25l |2452 |3z,|

VAL ADP ADF N VAL ADP G A t n 7 3 *4 6 2 F/g,/6 I I VAL ADPADF N VAL ADP G A I3 8 5 5 2 s Q) 1 I 5 VAL ADPADF VAL ADP e A (95 I5 2 I0 l 8 8 Z VALADP G A Patented July 18, 1972 3,678,461

20 Sheets-Shes t 9 VALADP ADF N VAL ADP ADF N VAL ADP 3 A I 2 6 I2 4 5 r l 3 l J l VAL ADPADF N VAL ADP s A 5 u 7 3 4 6 2 F/g./7 I L 1 VALADD ADF N VAL ADP c A l3 9 8 l 5 5 2 l L VAL ADPADF N LVAL ADP s A 6515 2 IO s 8 2 l VALADP s A |2 IO 2 I VALADPADF N VAL ADPADF N VAL ADP s A -||2s |2452 -|3z VALADP ADP N VAL ADP e A |5 7 l0 2 4 6 Z2 F/g,/ 9 4 L J VALADPADF N VAL ADT s A l3 9 a l 5 52 i (D L VAL ADPADF N VAL ADP s A n 2 3 e 8 2 1 (D L VAL ADT 6 Patented July 18, 1972 20 Sheets-Shes t 113 ENTER FROM USUAL PROCEDURE l I )VALUES OF OUANTIZERS IXU]. l'X(2),---IX(N) (2]VALUE OF N ASSIGN WEIGHT VALUES WTU), WT(2),---WT(N) Fig. 2/

READ PRE ASSiGNEO VALUE FOR ITOTAL 1Em=wm)* DIFUDHJDUMLIXHU K n= mum ITOTAL ITOT INFORMATION STORAGE AT LOCATION JC [TOT =ITOT-1E(N) JC =JC+ IDUM K( I DECISION OUTPUT YES 00 WE ADD RESPONSE? IDH,IDUM,IX(IH K (I IDUM Patented July 18, 1972 3,678,461

20 Sheets-Sheet l 4 QUANTIZER OUANTIZER SET: 3 LEVEL=I lDUM-I IDH, lDUM) COMPARATOR I X( LE VE L T 10(2 mum) COMPARATOR T 42 8 304 LEVEL REG.

COMPARATOR N. REG.

Patented July 18, 1972 3,678,461

20 Silents-Sheet 1h IDUM REGISTER IC REGiSTER ID(I,IC,&IDUMJ I KEY COMPONENT AND G 'NPUT OUTPUT SELECT MATR'X SELECT STORAGE I 83 I l ADP AND MATRIX INPUT OUTPUT SELECT STORAGE SELEcT Patented July 18, 1972 3,678,461

20 Sheets-Sheet l6 -ZUIILUELLIZILUK E LU O O U LL] 0 Patented July 18, 1972 20 Sheets-Sheet l 7 Patented July 18, 1972 3,678,461

20 Sheets-Sheet 1B SELECT OUTPUT OUTPUT SELECT SELECT V r w I 4 t .w \I we 0 M u U. D 4 V w i .u l M w 1 4 w u h .m 0 0 TT 4 A O 0 O A 4 b 4 W R h W 4 4 4 4 r (TL 5 D O 0 T 4 W w I WC S T 5 TM 0 FIIILF 0 ms J J m a .w d x w w I 4 2 3 4 I 2 N bk F LMULILZL L am w Ra a mumx w Patented July 18, 1972 20 Sheets-Sheet 19 OUTPUT SELECT CUTPUT COMPARE 1 TOTAL INPU T SELEC T man-u: M n" COMPARE IDUJDUM' COMPARE COMPARE COMPARE COMPARE OUTPUT SELECT b L. J

Fig. 27 

1. The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, d. accumulating a difference function from the comparison of each member of said untrained point with each member of said reference sets, e. comparing the accumulated difference function with the best difference function, and f. waiving further comparison of the reference set being compared with the untrained point when the accumulated difference function exceeds the best difference selected.
 2. The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, and d. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the selected best difference function.
 3. The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, d. establishinG a predetermined threshold, and e. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the predetermined threshold.
 4. The method of operating a trained processor beyond an untrained point where reference sets of signals are stored along with corresponding trained responses in a tree allocated file in a memory array which comprises: a. searching through the reference sets stored in the tree allocated file with a query set forming said untrained point, and b. waiving search of specific reference sets under conditions determined in the search.
 5. The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point during said comparison, d. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the selected best difference function, e. establishing a predetermined threshold, and f. waiving further comparison of reference sets being compared with the untrained point when the difference function being established exceeds the predetermined threshold.
 6. The method of claim 2 wherein said difference function is a straight numerical difference.
 7. The method of claim 1 wherein said difference function is a straight numerical difference, and the numerical difference for the comparison of each member of the untrained point and the reference set is weighted by a preassigned value.
 8. The method of claim 1 wherein said difference function is a geometrical distance measure.
 9. The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point, which comprises: a. sequentially comparing each member of the query set forming said untrained point with each corresponding member of each reference set stored in said tree allocated file, b. establishing a total difference function from the comparison of the untrained point with the reference set, c. establishing an individual contribution to said total difference from the comparison of each member of the untrained point with each corresponding member of the reference set, d. establishing a predetermined threshold for each member comparison, and e. waiving further comparison of reference sets being compared with the untrained point when an individual contribution exceeds said threshold.
 10. The method of operating a trained processor beyond an untrained point where reference sets of signals stored in a tree allocated file in a memory array along with an associated trained response form a data base to locate and extract a trained response to query sets of signals forming an untrained point which comprises: a. sequentially comparing a query set forming said untrained point with each reference set stored in said tree allocated file, b. establishing a difference function from the comparison of said untrained point with each reference set, c. selecting a best difference function indicating a possible response for said untrained point from said comparison, d. accumulating a difference function from the comparison of each member of said untrained point with each memBer of said reference sets, e. comparing the accumulated difference function with the best difference function, and f. waiving further comparison of the subtree rooted at the node at which the comparison of the member of said untrained point indicates that the accumulated difference function exceeds the best difference function selected.
 11. The method of claim 10 wherein said difference function is a straight numerical difference, and the numerical difference from the comparison of each member of the untrained point and the reference set is weighted by a preassigned value.
 12. The method of claim 11 wherein said difference function is a geometrical distance measure.
 13. The method of claim 4 wherein said conditions determined in the search constitute a difference function between said reference sets and said query sets.
 14. The method of claim 5 wherein said difference function is the square of the difference between said untrained point and said reference set.
 15. The method of claim 9 wherein said predetermined threshold is varied during operation of the processor.
 16. An automatic processor trained to produce trained responses to query sets of input signals comprising: a. a tree allocated file in a memory array for storing reference sets of signals along with corresponding trained responses, b. comparison means responsive to a query set of signals for comparing said query set, component by component, with said reference sets stored in said tree allocated file, and c. means for waiving comparison of specific reference sets under conditions determined in said comparison.
 17. An automatic processor trained to produce trained responses to query sets of input signals comprising: a. a tree allocated file in a memory array storing reference sets of signals along with corresponding trained responses, b. comparison means responsive to a query set of signals not encountered in training constituting an untrained point to compare said query set, component by component, with said reference sets of signals, c. means for storing the difference functions resulting from the comparison of said query sets with said reference sets by said comparison means, d. means for storing the difference function resulting from the total comparison between said query sets and said reference set, e. means for accumulating the difference function resulting from the comparison of each component of said query set with each component of said reference set, f. means for comparing said stored difference function and said accumulating difference function, g. means responsive to the comparison of said stored difference function and said accumulating difference function to waive further comparison of the reference sets being compared when said accumulating difference function exceeds said stored difference function.
 18. The automatic processor of claim 17 wherein the difference function is a straight numerical difference.
 19. The automatic processor of claim 17 wherein said difference function is a straight numerical difference, and the numerical difference for the comparison of each member of the untrained point in the reference set is weighted by a preassigned value.
 20. The automatic processor of claim 17 wherein said difference function is a geometric difference measure.
 21. The automatic processor of claim 17 including: a. means for establishing a predetermined threshold, b. means for comparing the difference function resulting from the comparison of each member of said reference set with each member of said query set, and c. means responsive to the difference between the comparison of each member of said reference set and each member of said untrained point for waiving further comparison when the difference exceeds a predetermined threshold.
 22. The automatic processor claimed in claim 17 wherein the trained response corresponding to the reference set having the best difference is stored.
 23. The automatic processor of claim 17 responsive to the storage of a trained response to indicate the number of trained responses stored.
 24. An automatic processor trained to produce trained responses to query sets of input signals comprising: a. a tree allocated file in a memory array for storing reference sets of signals along with corresponding responses, b. comparison means responsive to a query set of signals for comparing said query set, component by component, with said reference set stored in said tree allocated file, c. a register means for storing the result of the comparison between each component of said query set and said reference set, d. accumulating means for accumulating the differences between the components of said query and said reference sets, e. means for storing the total difference function resulting from the comparison between said query sets and said reference sets, f. means for comparing said total stored difference function and said accumulating difference function, g. means responsive to the comparison of said stored difference function and said accumulating difference function to stop further comparison beyond the node of the tree allocated file for any subtree rooted at that node when said accumulating difference function exceeds said stored difference function, and h. means for continuing the comparison of said query set and said untrained point at a new node in said tree allocated file. 